Dimension‐independent Markov chain Monte Carlo on the sphere

نویسندگان

چکیده

We consider Bayesian analysis on high-dimensional spheres with angular central Gaussian priors. These priors model antipodally symmetric directional data, are easily defined in Hilbert spaces and occur, for instance, density estimation binary level set inversion. In this paper we derive efficient Markov chain Monte Carlo methods approximate sampling of posteriors respect to these Our approaches rely lifting the problem ambient space exploit existing dimension-independent samplers linear spaces. By a push-forward kernel construction then obtain chains sphere which inherit reversibility spectral gap properties from Moreover, our proposed algorithms show efficiency numerical experiments. This article is protected by copyright. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov Chain Monte Carlo

Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...

متن کامل

Markov Chain Monte Carlo

This paper gives a brief introduction to Markov Chain Monte Carlo methods, which offer a general framework for calculating difficult integrals. We start with the basic theory of Markov chains and build up to a theorem that characterizes convergent chains. We then discuss the MetropolisHastings algorithm.

متن کامل

Markov chain Monte Carlo

One of the simplest and most powerful practical uses of the ergodic theory of Markov chains is in Markov chain Monte Carlo (MCMC). Suppose we wish to simulate from a probability density π (which will be called the target density) but that direct simulation is either impossible or practically infeasible (possibly due to the high dimensionality of π). This generic problem occurs in diverse scient...

متن کامل

On nonlinear Markov chain Monte Carlo

CHRISTOPHE ANDRIEU1, AJAY JASRA2, ARNAUD DOUCET3 and PIERRE DEL MORAL4 1Department of Mathematics, University of Bristol, Bristol BS8 1TW, UK. E-mail: [email protected] 2Department of Mathematics, Imperial College London, London, SW7 2AZ, UK. E-mail: [email protected] 3Department of Statistics, University of British Columbia, Vancouver, V6T 1Z2, Canada. E-mail: [email protected] 4Centre INRI...

متن کامل

On Adaptive Markov Chain Monte Carlo Algorithms

Abstract We look at adaptive MCMC algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the past of the process. We show under certain conditions that the generated stochastic process is ergodic, with appropriate stationary distribution. We then consider the Random Walk Metropolis (RWM) algorithm with normal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scandinavian Journal of Statistics

سال: 2023

ISSN: ['0303-6898', '1467-9469']

DOI: https://doi.org/10.1111/sjos.12653